The Baum-Connes Conjecture via Localisation of Categories

We redefine the Baum-Connes assembly map using simplicial approximation in the equivariant Kasparov category. This new interpretation is ideal for studying functorial properties and gives analogues of the assembly maps for all equivariant homology theories, not just for the K-theory of the crossed product. We extend many of the known techniques for proving the Baum-Connes conjecture to this more general setting

Limited energy spread in an SSC

http://accelconf.web.cern.ch/AccelConf/c78/papers/f-02.pd

Chromatic correlations at injection and related ejection problems in separated sector cyclotrons

International audienceInjection into a cyclotron, in order to preventemittance and phase spread dilution, requires propercouplings in the matching. One must first introduce aAP/r' associated with an r/AW coupling (through simplecticconditions) ; according to the angle of theaccelerating dees and the choice of harmonic numberthe(r,r') acceptance may also have to be tilted. Allthese effects are investigated in the case of theGANIL SSC's. At extraction corresponding correlationsexist. For a resonant system, extraction may be difficultwhen the energy spread is large because of thelarge coupling induced by resonance. A precessionalextraction which has been studied might in this casebe more efficient. Other ways for making extractioneasier are also considered. Moreover a new method ofphase compression at injection into the SSC is presentlyunder study at GANIL

CARTE: An Observation Station to Regulate Activity in a Learning Context

This chapter discusses the introduction of a new concept called "regulation" into a use model, which is part of a theoretical observation model called trace-based system (TBS). This concept defines a retroaction mechanism in an observation station. We present the results of experiments, in a learning context, with a prototype observation station called Collection, activity Analysis and Regulation based on Traces Enriched (CARTE)

Skolem properties, value-functions, and divisorial ideals

AbstractLet D be the ring of integers of a number field K. It is well known that the ring Int(D) = {f ϵ K[X] ¦ f (D) ⊆ D} of integer-valued polynomials on D is a Prüfer domain. Here we study the divisorial ideals of Int(D) and prove in particular that Int(D) has no divisorial prime ideal.We begin with the local case. We show that, if V is a rank-one discrete valuation domain with finite residue field, then the unitary ideals of Int(V) (that is, the ideals containing nonzero constants) are entirely determined by their values on the completion of V. This improves on the Skolem properties which only deal with finitely generated ideals. We then globalize and consider a Dedekind domain D with finite residue fields. We show that a prime ideal of t(D) is invertible if and only if it is divisorial, and also, in the case where the characteristic of D is 0, if and only if it is an upper to zero which is maximal

Reduction of the hot cracking sensitivity of CM-247LC superalloy processed by laser cladding using induction preheating

In the present work, the repair of CM-247LC superalloy has been investigated by using a laser cladding process. Since this material is well known for its high hot-cracking susceptibility in Heat Affected Zone during welding, repairing is quite challenging. In a first stage, a detailed investigation of the effect of cladding parameters on the crack susceptibility was carried out on coupons that received a low pre-heating condition. However, despite a reduction of crack sensitivity for low energy inputs, this material has systematically shown some evidence of cracking in the HAZ. In a second stage, attempts were made to reduce crack defects by using an induction preheating, with higher temperatures in the range of 800–1100 °C. With the highest pre-heating temperatures near 1100 °C, the partial dissolution of large γ’ precipitates, combined with re-precipitation of secondary and smaller γ' precipitates were helpful to prevent hot cracking

Conjunctions of Among Constraints

Many existing global constraints can be encoded as a conjunction of among constraints. An among constraint holds if the number of the variables in its scope whose value belongs to a prespecified set, which we call its range, is within some given bounds. It is known that domain filtering algorithms can benefit from reasoning about the interaction of among constraints so that values can be filtered out taking into consideration several among constraints simultaneously. The present pa- per embarks into a systematic investigation on the circumstances under which it is possible to obtain efficient and complete domain filtering algorithms for conjunctions of among constraints. We start by observing that restrictions on both the scope and the range of the among constraints are necessary to obtain meaningful results. Then, we derive a domain flow-based filtering algorithm and present several applications. In particular, it is shown that the algorithm unifies and generalizes several previous existing results.Comment: 15 pages plus appendi